Efficient Blind Signature Scheme based on Modified Generalized Bilinear Inversion for Multiple Signers

As a special anonymous signature, the blindness of blind signatures makes it to play an important role in electronic commerce. Sometimes, we need a blind signature under the multiple signers. However, to the best of our knowledge, the research on the blind signer for multiple signers is much less. In this paper, we propose a novel blind signature scheme for multiple signers based on a new security assumption. Then, we give a formal proof of security for the proposed schemes in the random oracle model. And we show that the proposed scheme satisfies the two properties of blind signature: blindness and unforgeability. As for the size of blind signature in the scheme, the length of our blind signature is independent of the numbers of signers and is approximate 320 bits. In terms of computation, no pairings operators are required in the blind signing phase and one pairing operator is needed in the verification phase. Thus, our scheme is very efficient.